OpinionIt a text mining system for cross%2Dlingual opinion analysis.

A topical link model for community discovery in textual interaction graph.

Understanding retweeting behaviors in social networks.

CasJoin a cascade chain for text similarity joins.

Weighting visual features with pseudo relevance feedback for CBIR.

MI%2DSIFT mirror and inversion invariant generalization for SIFT descriptor.

A new modeling reference direct adaptive sliding mode control for electromechanical actuator.

Product feature categorization with multilevel latent semantic association.



A study of information retrieval on accumulative social descriptions using the generation features.

Domain Adaptation with Latent Semantic Association for Named Entity Recognition.

Topic Distributions over Links on Web.
Abstract—It is well known that Web users create links with different intentions. However, a key question, which is not well studied, is how to categorize the links and how to quantify the strength of the influence of a web page on another if there is a link between the two linked web pages. In this paper, we focus on the problem of link semantics analysis, and propose a novel supervised learning approach to build a model, based on a training link-labeled and link-weighted graph where a link-label represents the category of a link and a link-weight represents the influence of one web page on the other in a link. Based on the model built, we categorize links and quantify the influence of web pages on the others in a large graph in the same application domain. We discuss our proposed approach, namely Pairwise Restricted Boltzmann Machines (PRBMs), and conduct extensive experimental studies to demonstrate the effectiveness of our approach using large real datasets. I.
Joint Emotion%2DTopic Modeling for Social Affective Text Mining.

Address standardization with latent semantic association.

Boosting social annotations using propagation.

Social Propagation Boosting Social Annotations for Web Mining.

Boosting social annotations using propagation.

ArnetMiner extraction and mining of academic social networks.
This paper addresses several key issues in the ArnetMiner system, which aims at extracting and mining academic social networks. Specifically, the system focuses on: 1) Extracting researcher profiles automatically from the Web; 2) Integrating the publication data into the network from existing digital libraries; 3) Modeling the entire academic network; and 4) Providing search services for the academic network. So far, 448,470 researcher profiles have been extracted using a unified tagging approach. We integrate publications from online Web databases and propose a probabilistic framework to deal with the name ambiguity problem. Furthermore, we propose a unified modeling approach to simultaneously model topical aspects of papers, authors, and publication venues. Search services such as expertise search and people association search have been provided based on the modeling results. In this paper, we describe the architecture and main features of the system. We also present the empirical evaluation of the proposed methods.
Exploring folksonomy for personalized search.

Floatcascade learning for fast imbalanced web mining.

Hidden sentiment association in chinese web opinion mining.

Optimizing web search using social annotations.
Folksonomies have shown interesting potential for improving information discovery and exploration. Recent folksonomy systems investigate on the use of tag assignments, which combine Web resources with annotations (tags), and the users that have created the annotations. In this paper, we investigate on the effect of grouping resources, i.e. creating sets of resources, and using this additional structure for search in folksonomies. Our experiments show that the quality of search result ranking can be significantly improved by introducing and exploiting the grouping of resources (onetailed t-Test, level of significance α = 0.05).
Towards effective browsing of large scale social annotations.
This paper is concerned with the problem of browsing social annotations. Today, a lot of services (e.g., Del.icio.us, Filckr) have been provided for helping users to manage and share their favorite URLs and photos based on social annotations. Due to the exponential increasing of the social annotations, more and more users, however, are facing the problem how to effectively find desired resources from large annotation data. Existing methods such as tag cloud and annotation matching work well only on small annotation sets. Thus, an effective approach for browsing large scale annotation sets and the associated resources is in great demand by both ordinary users and service providers. In this paper, we propose a novel algorithm, namely Effective Large Scale Annotation Browser (ELSABer), to browse large-scale social annotation data. ELSABer helps the users browse huge number of annotations in a semantic, hierarchical and efficient way. More specifically, ELSABer has the following features: 1) the semantic relations between annotations are explored for browsing of similar resources; 2) the hierarchical relations between annotations are constructed for browsing in a top-down fashion; 3) the distribution of social annotations is studied for efficient browsing. By incorporating the personal and time information, ELSABer can be further extended for personalized and time-related browsing. A prototype system is implemented and shows promising results.
Empirical Study on the Performance Stability of Named Entity Recognition Model across Domains.

RStar an RDF storage and query system for enterprise resource management.

ORIENT Integrate Ontology Engineering into Industry Tooling Environment.
Orient is a project to develop an ontology engineering tool  that integrates into existing industry tooling environments -- the Eclipse  platform and the WebSphere Studio developing tools family. This paper  describes how two important issues are addressed during the project,  namely tool integration and scalability. We show how Orient morphs  into the Eclipse platform and achieves UI and data level integration  with the Eclipse platform and other modelling tools. We also describe  how we implemented a scalable RDF(S) storage, query, manipulation  and inference mechanism on top of a relational database. In particular,  we report the empirical performance of our RDF(S) closure inference  algorithm on a DB2 database.
Market Intelligence Portal An entity%2Dbased system for managing market intelligence.

Novel algorithm in relevance feedback in region%2Dbased image retrieval system.

Document Clustering Based on Vector Quantization and Growing%2DCell Structure.

Novel algorithm in relevance feedback in region%2Dbased image retrieval system.

Relevance feedback in content%2Dbased image retrieval Bayesian framework
Research has been devoted in the past few years to relevance feedback as an effective solution to improve performance of content-based image retrieval (CBIR). In this paper, we propose a new feedback approach with progressive learning capability combined with a novel method for the feature subspace extraction. The proposed approach is based on a Bayesian classifier and treats positive and negative feedback examples with different strategies. Positive examples are used to estimate a Gaussian distribution that represents the desired images for a given query; while the negative examples are used to modify the ranking of the retrieved candidates. In addition, feature subspace is extracted and updated during the feedback process using a Principal Component Analysis (PCA) technique and based on user&#039;s feedback. That is, in addition to reducing the dimensionality of feature spaces, a proper subspace for each type of features is obtained in the feedback process to further improve the retrieval accuracy. Experiments demonstrate that the proposed method increases the retrieval speed, reduces the required memory and improves the retrieval accuracy significantly.
Relevance Feedback and Learning in Content%2DBased Image Search.

Relevance Feedback in CBIR.
Abstract: The Relevance Feedback has been used to improve the performance of CBIR algorithms. This paper presents a relevance feedback method based on the regularized least squares classifier, and a technique to select feedback information in order to increase the learning rate. Experimental results are presented in the paper to illustrate the performance of the proposed relevance feedback method.
Extraction of feature subspaces for content%2Dbased retrieval using relevance feedback.
In the past few years, relevance feedback (RF) has been used as an effective solution for content-based image retrieval (CBIR). Although effective, the RF-CBIR framework does not address the issue of feature extraction for dimension reduction and noise reduction. In this paper, we propose a novel method for extracting features for the class of images represented by the positive images provided by subjective RF. Principal Component Analysis (PCA) is used to reduce both noise contained in the original image features and dimensionality of feature spaces. The method increases the retrieval speed and reduces the memory significantly without sacrificing the retrieval accuracy.
Correlation%2DBased Web Document Clustering for Adaptive Web Interface Design.

Extraction of feature subspaces for content%2Dbased retrieval using relevance feedback.
In the past few years, relevance feedback (RF) has been used as an effective solution for content-based image retrieval (CBIR). Although effective, the RF-CBIR framework does not address the issue of feature extraction for dimension reduction and noise reduction. In this paper, we propose a novel method for extracting features for the class of images represented by the positive images provided by subjective RF. Principal Component Analysis (PCA) is used to reduce both noise contained in the original image features and dimensionality of feature spaces. The method increases the retrieval speed and reduces the memory significantly without sacrificing the retrieval accuracy.
Relevance feedback using a Bayesian classifier in content%2Dbased image retrieval.
As an effective solution of the content-based image retrieval (CBIR) problems, relevance feedback has been put on many efforts for the past few years. In this paper, we propose a new relevance feedback approach with progressive leaning capability. It is based on a Bayesian classifier and treats positive and negative feedback examples with different strategies. It can utilize previous users&#039; feedback information to help the current query. Experimental results show that our algorithm is achieves high accuracy and effectiveness on real-world image collections.
A prediction system for multimedia pre%2Dfetching in Internet.
The rapid development of Interact has resulted in more and more multimedia in Web content. However, due to the limitation in the bandwidth and huge size of the multimedia data, users always suffer from long time waiting. On the other hand, if we can predict the web object or page that the user most likely will view next while the user is viewing the current page, and pre-fetch the content, then the perceived network latency can be significantly reduced. In this paper, we present an n-gram based model to utilize path profiles of users from very large web log to predict the users &#039; future requests. Our model is based on a simple extension of existing point-based models for such predictions, but our results show that by sacrificing the applicability somewhat one can gain a great deal in prediction precision. Also we present an efficient method to compress the prediction model size so that it can be fitted into the main memory. Our result can potentially be applied to a wide range of applications on the web, including pre-fetehing, enhancement of recommendation systems as well as web caching policies. The experiments based on three realistic web logs have proved the effectiveness of the proposed scheme.
Using Bayesian classifier in relevant feedback of image retrieval.
Relevance feedback is a powerful technique in contentbased image retrieval (CBIR) and has been an active research area for the past few years. In this paper, we propose a new relevance feedback approach based on Bayesian classifier and it treats positive and negative feedback examples with different strategies. For positive examples, a Bayesian classifier is used to determine the distribution of the query space. A `dibbling&#039; process is applied to penalize images that are near the negative examples in the query and retrieval refinement process. The proposed algorithm also has the progressive learning capability that utilize past feedback information to help the current query. Experimental results show that our algorithm is effectiveness.
